Perfect Byte-Correcting Codes
نویسنده
چکیده
We present a few new constructions for perfect linear single byte-correcting codes. These constructions generate some perfect single byte-correcting codes with new parameters, and some perfect single bytecorrecting codes with known parameters and simpler presentation and implementation over the known codes. It is also shown that nonequivalent perfect linear single byte-correcting codes exist when all the bytes have the same size.
منابع مشابه
Constructions for perfect 2-burst-correcting codes
In this correspondence, we present two constructions. In the first construction, we show how to generate perfect linear codes of length 2 , 5, and redundancy , which correct a single burst of length 2. In the second construction, we show how to generate perfect linear codes organized in bytes of length 2 , 5, with redundancy divisible by , which correct a single burst of length 2 within the bytes.
متن کاملNew Double-Byte Error-Correcting Codes for Memory Systems
Error-correcting or error-detecting codes have been used in the computer industry to increase reliability, reduce service costs, and maintain data integrity. The single-byte error-correcting and double-byte error-detecting (SbEC-DbED) codes have been successfully used in computer memory subsystems. There are many methods to construct double-byte error-correcting (DbEC) codes. In the present pap...
متن کاملOn perfect deletion-correcting codes
In this article we present constructions for perfect deletion-correcting codes. The first construction uses perfect deletion-correcting codes without repetition of letters to construct other perfect deletion-correcting codes. This is a generalization of the construction shown in [1]. In the third section we investigate several constructions of perfect deletioncorrecting codes using designs. In ...
متن کاملSpectrum of Sizes for Perfect Deletion-Correcting Codes
One peculiarity with deletion-correcting codes is that perfect t-deletion-correcting codes of the same length over the same alphabet can have different numbers of codewords, because the balls of radius t with respect to the Levenshtĕın distance may be of different sizes. There is interest, therefore, in determining all possible sizes of a perfect t-deletion-correcting code, given the length n a...
متن کاملPaper Special Section on Information Theory and Its Applications a Class of Error Locating Codes { Sec 0 S E=b El Codes { 3
SUMMARY This paper proposes a new class of error locating codes which corrects random single-bit errors and indicates a location of an erroneous b-bit byte which includes e-bit errors, where 2 < = e < b, called SEC 0 S e=b EL codes. This type of codes is very suitable for an application to memory systems constructed from byte-organized memory chips because this corrects random single-bit errors...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- IEEE Trans. Information Theory
دوره 44 شماره
صفحات -
تاریخ انتشار 1998